Are space-filling curves efficient small antennas?
نویسندگان
چکیده
منابع مشابه
Efficient Neighbor-Finding on Space-Filling Curves
Space-filling curves (SFC, also known as FASS-curves) are a useful tool in scientific computing and other areas of computer science to sequentialize multidimensional grids in a cache-efficient and parallelization-friendly way for storage in an array. Many algorithms, for example grid-based numerical PDE solvers, have to access all neighbor cells of each grid cell during a grid traversal. While ...
متن کاملUnconventional Space-filling Curves
A 2-dimensional space-filling curve, here, is a surjective continuous map from an interval to a 2-dimensional space. To construct a new space-filling curve distinct and much different from Hilbert’s, Peano’s, and the Z-order, we first observe that all three of these curves are based on self-similar fractals–in particular, the recursive definition of the sequences of functions that converge to t...
متن کاملSimple and Efficient Mesh Layout with Space-Filling Curves
We present a simple and efficient algorithm to compute cache-friendly layouts of unstructured geometric data. Coherent mesh layouts minimize cache misses and page faults by laying out vertices, triangles or tetrahedra in a spatially structured manner. Recently, Yoon et al. have shown that it is possible to construct an optimal cache-oblivious mesh layout (COML) for surface and volume data. Howe...
متن کاملSpace filling curves in steganalysis
We introduce a new method to increase the reliability of current steganalytic techniques by optimising the sample order. Space filling curves (e. g., Hilbert curve) take advantage of the correlation of adjacent pixels and thus make the detection of steganographic messages with low change densities more reliable. The findings are applicable, but not limited to LSB steganalysis. An experimental c...
متن کاملContext-based Space Filling Curves
A context-based scanning technique for images is presented. An image is scanned along a context-based space filling curve that is computed so as to exploit inherent coherence in the image. The resulting one-dimensional representation of the image has improved autocorrelation compared with universal scans such as the PeanoHilbert space filling curve. An efficient algorithm for computing context-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Antennas and Wireless Propagation Letters
سال: 2003
ISSN: 1536-1225,1548-5757
DOI: 10.1109/lawp.2003.816638